Efficient Graph Algorithms Using Lazy Monolithic Arrays
نویسنده
چکیده
منابع مشابه
Lazy Receding Horizon A* for Efficient Path Planning in Graphs with Expensive-to-Evaluate Edges
Motion-planning problems, such as manipulation in cluttered environments, often require a collision-free shortest path to be computed quickly given a roadmap graph G. Typically, the computational cost of evaluating whether an edge of G is collision-free dominates the running time of search algorithms. Algorithms such as Lazy Weighted A* (LWA*) and LazySP have been proposed to reduce the number ...
متن کاملArrays in a Lazy Functional Language – a case study: the Fast Fourier Transform
The array plays a prominent role in imperative programming languages because the data structure bears a close resemblance to the mathematical notion of a vector and because array operations can be implemented efficiently. Not all lazy functional languages offer arrays as a primitive data structure because laziness makes it difficult to implement arrays efficiently. We study 8 different versions...
متن کاملThe Implementation and Efficiency of Arrays in Clean 1.1
We present a new approach to implementing arrays in a pure lazy functional programming language. The arrays can be updated destructively by using uniqueness typing, and the elements can be unboxed. We describe the implementation of these arrays in the functional programming language Clean 1.1. The performance of two sorting algorithms and a fast fourier transformation written in Clean using arr...
متن کاملOn Directed and Undirected Propagation Algorithms for Bayesian Networks
Message-passing inference algorithms for Bayes nets can be broadly divided into two classes: i) clustering algorithms, like Lazy Propagation, Jensen’s or Shafer-Shenoy’s schemes, that work on secondary undirected trees; and ii) conditioning methods, like Pearl’s, that use directly Bayes nets. It is commonly thought that algorithms of the former class always outperform those of the latter becaus...
متن کاملPrediction of daily precipitation of Sardasht Station using lazy algorithms and tree models
Due to the heterogeneous distribution of precipitation, predicting its occurrence is one of the primary and basic solutions to prevent possible disasters and damages caused by them. Considering the high amount of precipitation in Sardasht County, the people of this city turning to agriculture in recent years and not using classification models in the studied station, it is necessary to predict ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Funct. Program.
دوره 8 شماره
صفحات -
تاریخ انتشار 1998